A faster algorithm for testing polynomial representability of functions over finite integer rings
نویسندگان
چکیده
Article history: Received 31 July 2014 Received in revised form 9 February 2015 Accepted 10 February 2015 Available online 18 February 2015 Communicated by V.Y. Pan
منابع مشابه
Gray Images of Constacyclic Codes over some Polynomial Residue Rings
Let be the quotient ring where is the finite field of size and is a positive integer. A Gray map of length over is a special map from to ( . The Gray map is said to be a ( )-Gray map if the image of any -constacyclic code over is a -constacyclic code over the field . In this paper we investigate the existence of ( )-Gray maps over . In this direction, we find an equivalent ...
متن کاملAutomorphisms of Rings and Applications to Complexity
Rings are fundamental mathematical objects with two operations, addition and multiplication, suitably defined. A known way of studying the structure of rings is to consider automorphisms of rings. In my PhD thesis I consider finite dimensional rings represented in terms of their additive basis and study the computational complexity of various automorphism problems of rings in this representatio...
متن کاملFactoring polynomials over Z4 and over certain Galois rings
It is known that univariate polynomials over finite local rings factor uniquely into primary pairwise coprime factors. Primary polynomials are not necessarily irreducible. Here we describe a factorisation into irreducible factors for primary polynomials over Z4 and more generally over Galois rings of characteristic p. An algorithm is also given. As an application, we factor x − 1 and x + 1 over...
متن کاملGlobal optimization of mixed-integer polynomial programming problems: A new method based on Grobner Bases theory
Mixed-integer polynomial programming (MIPP) problems are one class of mixed-integer nonlinear programming (MINLP) problems where objective function and constraints are restricted to the polynomial functions. Although the MINLP problem is NP-hard, in special cases such as MIPP problems, an efficient algorithm can be extended to solve it. In this research, we propose an algorit...
متن کاملar X iv : 0 81 0 . 31 64 v 1 [ m at h . D S ] 1 7 O ct 2 00 8 LINEAR DYNAMICAL SYSTEMS OVER FINITE RINGS
The problem of linking the structure of a finite linear dynamical system with its dynamics is well understood when the phase space is a vector space over a finite field. The cycle structure of such a system can be described by the elementary divisors of the linear function, and the problem of determining whether the system is a fixed point system can be answered by computing and factoring the s...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Theor. Comput. Sci.
دوره 579 شماره
صفحات -
تاریخ انتشار 2015